Block-sparse Basis Sets for Improved Audio Content Estimation
نویسندگان
چکیده
Unsupervised lexicon learning techniques for audio-in-the-wild typically assume that only one of the lexical units is active at any given point in time (hard quantization) or use soft counts to avoid committing to one unit (soft quantization). In reality, the audio will usually be produced as a mixture of the different audio concepts in the lexicon. In this paper, we propose a model where the audio content is assumed to be generated by a mixture of a sparse subset of the lexical units thus guiding the system toward a better estimate of presence of the concepts. We present an approach that builds on current lexicon learning frameworks, and develop a novel algorithm to estimate the contribution of different sources by imposing block-sparsity constraints on the lexicon. Our proposed framework shows significant improvement over the standard lexicon learning framework on a retrieval task for audio-in-the-wild.
منابع مشابه
Improved Channel Estimation for DVB-T2 Systems by Utilizing Side Information on OFDM Sparse Channel Estimation
The second generation of digital video broadcasting (DVB-T2) standard utilizes orthogonal frequency division multiplexing (OFDM) system to reduce and to compensate the channel effects by utilizing its estimation. Since wireless channels are inherently sparse, it is possible to utilize sparse representation (SR) methods to estimate the channel. In addition to sparsity feature of the channel, the...
متن کاملEstimation of Simultaneously Sparse and Low Rank Matrices
The paper introduces a penalized matrix estimation procedure aiming at solutions which are sparse and low-rank at the same time. Such structures arise in the context of social networks or protein interactions where underlying graphs have adjacency matrices which are block-diagonal in the appropriate basis. We introduce a convex mixed penalty which involves `1-norm and trace norm simultaneously....
متن کاملDensity Estimation with Adaptive Sparse Grids for Large Data Sets
Nonparametric density estimation is a fundamental problem of statistics and data mining. Even though kernel density estimation is the most widely used method, its performance highly depends on the choice of the kernel bandwidth, and it can become computationally expensive for large data sets. We present an adaptive sparse-grid-based density estimation method which discretizes the estimated dens...
متن کاملLearning hybrid linear models via sparse recovery
We introduce new methods to tackle the problem of hybrid linear learning—learning the number and dimensions of the subspaces present in a collection of high-dimensional data and then determining a basis or overcomplete dictionary that spans each of the subspaces. To do this, we pose this problem as the estimation of a set of points on the Grassmanian manifold G(k, n), i.e., the collection of al...
متن کاملA Block-Coordinate Descent Approach for Large-scale Sparse Inverse Covariance Estimation
The sparse inverse covariance estimation problem arises in many statistical applications in machine learning and signal processing. In this problem, the inverse of a covariance matrix of a multivariate normal distribution is estimated, assuming that it is sparse. An `1 regularized log-determinant optimization problem is typically solved to approximate such matrices. Because of memory limitation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013